全文获取类型
收费全文 | 5052篇 |
免费 | 420篇 |
国内免费 | 327篇 |
专业分类
化学 | 274篇 |
晶体学 | 2篇 |
力学 | 25篇 |
综合类 | 139篇 |
数学 | 5116篇 |
物理学 | 243篇 |
出版年
2024年 | 10篇 |
2023年 | 100篇 |
2022年 | 138篇 |
2021年 | 120篇 |
2020年 | 199篇 |
2019年 | 227篇 |
2018年 | 215篇 |
2017年 | 198篇 |
2016年 | 123篇 |
2015年 | 90篇 |
2014年 | 174篇 |
2013年 | 451篇 |
2012年 | 191篇 |
2011年 | 295篇 |
2010年 | 299篇 |
2009年 | 436篇 |
2008年 | 378篇 |
2007年 | 274篇 |
2006年 | 316篇 |
2005年 | 216篇 |
2004年 | 199篇 |
2003年 | 173篇 |
2002年 | 164篇 |
2001年 | 147篇 |
2000年 | 105篇 |
1999年 | 95篇 |
1998年 | 89篇 |
1997年 | 64篇 |
1996年 | 47篇 |
1995年 | 51篇 |
1994年 | 39篇 |
1993年 | 28篇 |
1992年 | 25篇 |
1991年 | 15篇 |
1990年 | 12篇 |
1989年 | 16篇 |
1988年 | 15篇 |
1987年 | 9篇 |
1986年 | 5篇 |
1985年 | 12篇 |
1984年 | 12篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有5799条查询结果,搜索用时 31 毫秒
91.
92.
设图$G$,其中边集为$E(G)$,顶点集$V(G)$.反对称分割指数被定义为$ISDD(G)=\sum_{uv \in E(G)}\dfrac{d_ud_v}{d_u^2+d_v^2}$,其中$d_u$, $d_v$分别为顶点$u,v$的度.化学树就是顶点的度不超过4的树.在本文中,我们刻画出具有最小反对称分割指数的$n$阶化学树. 相似文献
93.
给定图$G$,对图$G$的每条边确定一个方向,称为$G$的定向图$G^\sigma$, $G$称为$G^\sigma$的基础图. $G^\sigma$的斜邻接矩阵$S(G^\sigma)$是反对称矩阵,其特征值是0或纯虚数. $S(G^\sigma)$所有特征值的$k$次幂之和称为$G^\sigma$的$k$阶斜谱矩,其中$k$是非负整数.斜谱矩序列可用于对图进行排序.本文主要研究定向树和定向单圈图的斜谱矩,并对这两类图的斜谱矩序列依照字典序进行排序.首先确定了直径为$d$的树作为基础图的所有定向树中,斜谱矩序最大的$2\lfloor\frac{d}{4}\rfloor$个图; 然后确定以围长为$g$的单圈图作为基础图的所有定向单圈图中, 斜谱矩序最大的$2\lfloor\frac{g}{4}\rfloor+1$个图. 相似文献
94.
令$\eta(\Gamma)$和$c(\Gamma)$是符号图$\Gamma$的零度和基本圈数. 一个符号圈拼接图是指每个块都是圈的连通符号图. 本文证明了对任意符号拼接图$\eta(\Gamma)\le c(\Gamma)+1$成立, 并且刻画了等号成立的极图, 推广了王登银等人(2022)在简单圈拼接图上的结果. 此外, 我们证明了任意的符号拼接图$\eta(\Gamma)\neq c(\Gamma)$, 给出了满足$\eta(\Gamma)=c(\Gamma)-1$的符号拼接图的一些性质并刻画处$\eta(\Gamma)=c(\Gamma)-1$的二部符号拼接图. 相似文献
95.
Yanguang Li 《Journal of Dynamics and Differential Equations》2003,15(4):699-730
For finite-dimensional maps and periodic systems, Palmer rigorously proved Smale horseshoe theorem using shadowing lemma in 1988 [20]. For infinite-dimensional maps and periodic systems, such a proof was completed by Steinlein and Walther in 1990 [30], and Henry in 1994 [9]. For finite-dimensional autonomous systems, such a proof was accomplished by Palmer in 1996 [17]. For infinite-dimensional autonomous systems, the current article offers such a proof. First we prove an Inclination Lemma to set up a coordinate system around a pseudo-orbit. Then we utilize graph transform and the concept of persistence of invariant manifold, to prove the existence of a shadowing orbit. 相似文献
96.
97.
Khodakhast Bibak 《International journal of quantum chemistry》2013,113(8):1209-1212
For a graph G, a “spanning tree” in G is a tree that has the same vertex set as G. The number of spanning trees in a graph (network) G, denoted by t(G), is an important invariant of the graph (network) with lots of decisive applications in many disciplines. In the article by Sato (Discrete Math. 2007, 307, 237), the number of spanning trees in an (r, s)‐semiregular graph and its line graph are obtained. In this article, we give short proofs for the formulas without using zeta functions. Furthermore, by applying the formula that enumerates the number of spanning trees in the line graph of an (r, s)‐semiregular graph, we give a new proof of Cayley's Theorem. © 2013 Wiley Periodicals, Inc. 相似文献
98.
Nonequilibrium free energy and information flow of a double quantum-dot system with Coulomb coupling 下载免费PDF全文
Zhiyuan Lin 《中国物理 B》2021,30(8):80501-080501
We build a double quantum-dot system with Coulomb coupling and aim at studying connections among the entropy production, free energy, and information flow. By utilizing concepts in stochastic thermodynamics and graph theory analysis, Clausius and nonequilibrium free energy inequalities are built to interpret local second law of thermodynamics for subsystems. A fundamental set of cycle fluxes and affinities is identified to decompose two inequalities by using Schnakenberg's network theory. Results show that the thermodynamic irreversibility has energy-related and information-related contributions. A global cycle associated with the feedback-induced information flow would pump electrons against the bias voltage, which implements a Maxwell demon. 相似文献
99.
Jun Jason Luo 《Mathematische Nachrichten》2019,292(5):1032-1042
Recently Lipschitz equivalence of self‐similar sets on has been studied extensively in the literature. However for self‐affine sets the problem is more awkward and there are very few results. In this paper, we introduce a w‐Lipschitz equivalence by repacing the Euclidean norm with a pseudo‐norm w. Under the open set condition, we prove that any two totally disconnected integral self‐affine sets with a common matrix are w‐Lipschitz equivalent if and only if their digit sets have equal cardinality. The main methods used are the technique of pseudo‐norm and Gromov hyperbolic graph theory on iterated function systems. 相似文献
100.
Marién Abreu Jan Goedgebeur Domenico Labbate Giuseppe Mazzuoccolo 《Journal of Graph Theory》2019,92(4):415-444
A -bisection of a bridgeless cubic graph is a -colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes ( monochromatic components in what follows) have order at most . Ban and Linial Conjectured that every bridgeless cubic graph admits a -bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph with has a -edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (ie, a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we provide evidence of a strong relation of the conjectures of Ban-Linial and Wormald with Ando's Conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above-mentioned conjectures. Moreover, we prove Ban-Linial's Conjecture for cubic-cycle permutation graphs. As a by-product of studying -edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests. 相似文献